Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory

نویسندگان

  • João Araújo
  • Wolfram Bentz
  • Edward Dobson
  • Janusz Konieczny
  • Joy Morris
چکیده

We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of unit circulant digraphs. For each class, we either explicitly determine the automorphism group or we show that the graph is a “normal” circulant, so the automorphism group is contained in the normalizer of a cycle. Then we use these characterizations to prove results on the automorphisms of the endomorphism monoids of those digraphs. The paper ends with a list of open problems on graphs, number theory, groups and semigroups.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On automorphism groups of circulant digraphs of square-free order

We show that the full automorphism group of a circulant digraph of square-free order is either the intersection of two 2-closed groups, each of which is the wreath product of 2-closed groups of smaller degree, or contains a transitive normal subgroup which is the direct product of two 2-closed groups of smaller degree. The work in this paper makes contributions to the solutions of two problems ...

متن کامل

Circulant Homogeneous Factorisations of Complete Digraphs Kpd with p an Odd Prime

Let F = (Kn,P) be a circulant homogeneous factorisation of index k, that means P is a partition of the arc set of the complete digraph Kn into k circulant factor digraphs such that there exists σ ∈ Sn permuting the factor circulants transitively amongst themselves. Suppose further such an element σ normalises the cyclic regular automorphism group of these circulant factor digraphs, we say F is ...

متن کامل

A note on arc-transitive circulant digraphs

We prove that, for a positive integer n and subgroup H of automorphisms of a cyclic group Z of order n, there is up to isomorphism a unique connected circulant digraph based on Z admitting an arc-transitive action of ZzH. We refine the Kovács–Li classification of arc-transitive circulants to determine those digraphs with automorphism group larger than ZzH. As an application we construct, for ea...

متن کامل

On the Automorphism Group of Integral Circulant Graphs

The integral circulant graph Xn(D) has the vertex set Zn = {0, 1, 2, . . . , n − 1} and vertices a and b are adjacent, if and only if gcd(a − b, n) ∈ D, where D = {d1, d2, . . . , dk} is a set of divisors of n. These graphs play an important role in modeling quantum spin networks supporting the perfect state transfer and also have applications in chemical graph theory. In this paper, we deal wi...

متن کامل

Green's Symmetries in Finite Digraphs

The semigroup DV of digraphs on a set V of n labeled vertices is defined. It is shown that DV is faithfully represented by the semigroup Bn of n × n Boolean matrices and that the Green’s L, R, H, and D equivalence classifications of digraphs in DV follow directly from the Green’s classifications already established for Bn. The new results found from this are: (i) L, R, and H equivalent digraphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorica

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2018